Guaranteed Scoring Games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guaranteed Scoring Games

The class of Guaranteed Scoring Games (GS) is the class of all two-player scoring combinatorial games with the property that Normal-play games (Conway et. al.) are order embedded into GS. They include, as subclasses, the scoring games considered by Milnor (1953), Ettinger (1996) and Johnson (2014). We present the structure of GS and the techniques needed to analyze a sum of guaranteed games. Fi...

متن کامل

Guaranteed Inertia Functions in Dynamical Games

This paper deals with inertia functions in control theory introduced in [7, 8, Aubin, Bernardo & Saint-Pierre] and their adaptation to dynamical games. The inertia function associates with any initial state-control pair the smallest of the worst norms over time of the velocities of the controls regulating viable evolutions. For tychastic systems (parameterized systems where the parameters are t...

متن کامل

Scoring rule voting games and dominance solvability

This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) of general scoring rule voting games. The scoring rules we study include Plurality rule, Approval voting, Negative Plurality Rule, Borda rule and Relative Utilitarianism. We provide a classification of scoring rule voting games according to whether the sufficient conditions for dominance solvabili...

متن کامل

Guaranteed Strategies for nonlinear Multi-Player Pursuit-Evasion Games

In this paper, we provide a methodology to design strategies for either guaranteed capture or guaranteed evasion in the case of pursuit-evasion games with multiple players which are represented by nonlinear dynamic models. This methodology is based on the continuously differentiable upper and lower approximations of the minimum and maximum function of an arbitrary number of arguments, compariso...

متن کامل

Basketball scoring in NBA games: An example of complexity

Scoring in a basketball game is a process highly dynamic and nonlinear type. The level of NBA teams improve each season. They incorporate to their rosters the best players in the world. These and other mechanisms, make the scoring in the NBA basketball games be something exciting, where, on rare occasions, we really know what will be the result at the end of the game. We analyzed all the games ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2016

ISSN: 1077-8926

DOI: 10.37236/5417